A q - QUEENS PROBLEM I . GENERAL THEORY MARCH 3 , 2013

نویسندگان

  • SETH CHAIKEN
  • CHRISTOPHER R. H. HANUSA
  • THOMAS ZASLAVSKY
چکیده

We establish a general counting theory for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen, and we apply the theory to square boards. We show that the number of ways to place q nonattacking queens on a chessboard of variable size n but fixed shape is a quasipolynomial function of n. The period of the quasipolynomial is bounded by a function of the queen's move directions. Similar conclusions hold for any piece whose moves have unlimited length. We apply our theory to the square board, to show that the highest-order coefficients of the counting quasipolynomial do not depend on the size of the board. On the other hand, we present simple pieces for which the fourth quasipolynomial coefficient is periodic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A q - QUEENS PROBLEM V . THE BISHOPS ’ PERIOD

Part I showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n. We prove the previously empirically observed period of the bishops quasipolynomial, which is exactly 2 for three or more bishops. The proof depends on signed graphs and the Ehrhart theory of inside-out polytopes.

متن کامل

A q - QUEENS PROBLEM V . THE BISHOPS ’ PERIOD

Part I showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n. We prove the previously empirically observed period of the bishops quasipolynomial, which is exactly 2 for three or more bishops. The proof depends on signed graphs and the Ehrhart theory of inside-out polytopes.

متن کامل

A q - QUEENS PROBLEM . II . THE SQUARE BOARD August

We apply to the n × n chessboard the counting theory from Part I for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen. Part I showed that the number of ways to place q identical nonattacking pieces is given by a quasipolynomial function of n of degree 2q, whose coefficients are (essentially) polynomials in q that depend cyclically on n. Here we study...

متن کامل

2 0 Fe b 20 14 A q - QUEENS PROBLEM II . THE SQUARE BOARD

We apply to the n× n chessboard the counting theory from Part I for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen. Part I showed that the number of ways to place q identical nonattacking pieces is given by a quasipolynomial function of n of degree 2q, whose coefficients are (essentially) polynomials in q that depend cyclically on n. Here we study ...

متن کامل

A q-QUEENS PROBLEM III. PARTIAL QUEENS

Parts I and II showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n in which the coefficients are essentially polynomials in q. We explore this function for partial queens, which are pieces like the rook and bishop whose moves are a subset of those of the queen. We compute the five highest-order coe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013